Restricted space algorithms for isomorphism on bounded treewidth graphs
نویسندگان
چکیده
منابع مشابه
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted space algorithms for these problems proving the following results: • Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be com...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملKnown Algorithms on Graphs on Bounded Treewidth are Probably Optimal
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that SAT cannot be solved in (2−ǫ)m time, we show that for any ǫ > 0; • INDEPENDENT SET cannot be solved in (2 − ǫ)tw(G)|V (G)| time, • DOMINATING SET cannot be s...
متن کاملAlgorithms for graphs of bounded treewidth via orthogonal range searching
We show that, for any fixed constant k ≥ 3, the sum of the distances between all pairs of vertices of an abstract graphs with n vertices and treewidth at most k can be computed in O(n logk−1 n) time. We also show that, for any fixed constant k ≥ 2, the dilation of a geometric graph (i.e., a graph drawn in the plane with straight-line segments) with n vertices and treewidth at most k can be comp...
متن کاملI/O-Efficient Algorithms for Bounded Treewidth Graphs
We present an I/O-efficient algorithm for the single source shortest path (SSSP) problem for graphs of bounded treewidth. For sparse graphs in general SSSP seems to be extremely hard to solve. We show how to solve SSSP in O sort N I/Os for the above class of graphs. An important ingredient to our solution is an O sort N algorithm to compute a tree-decomposition of width k of the given graph. Gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2012
ISSN: 0890-5401
DOI: 10.1016/j.ic.2012.05.003